On-Line Scheduling Algorithm for Real-Time Multiprocessor Systems with ACO
نویسندگان
چکیده
منابع مشابه
On-line scheduling algorithm for real-time multiprocessor systems with ACO
The Ant Colony Optimization algorithms (ACO) are computational models inspired by the collective foraging behavior of ants. By looking at the strengths of ACO, they are the most appropriate for scheduling of tasks in soft real-time systems. In this paper, ACO based scheduling algorithm for real-time operating systems (RTOS) has been proposed. During simulation, results are obtained with periodi...
متن کاملACO Based Dynamic Scheduling Algorithm for Real-Time Multiprocessor Systems
The Ant Colony Optimization (ACO) algorithms are computational models inspired by the collective foraging behavior of ants. The ACO algorithms provide inherent parallelism, which is very useful in multiprocessor environments. They provide balance between exploration and exploitation along with robustness and simplicity of individual agent. In this paper, ACO based dynamic scheduling algorithm f...
متن کاملLda { Scalable, Oo-line Multiprocessor Scheduling for Real-time Systems
OO-line task scheduling remains important for real-time systems since such algorithms may be used to schedule tasks known at the time of system initialization. The LDA algorithm described in this paper uses both task laxities and deadlines when deciding processor allocation and task scheduling for a multipro-cessor system. The algorithm is diierent from existing algorithms (1) in its use of dis...
متن کاملTwo-level Hierarchical Scheduling Algorithm for Real-time Multiprocessor Systems
The Earliest Deadline First (EDF) scheduling algorithm has the least runtime complexity among joblevel fixed-priority algorithms for scheduling tasks on multiprocessor architectures. However, EDF suffers from suboptimality in multiprocessor systems. This paper proposes a new restricted migration-based scheduling algorithm for multiprocessor real-time systems, called Two-level Hierarchical Sched...
متن کاملAn Efficient Dynamic Scheduling Algorithm For Multiprocessor Real-Time Systems
Many time-critical applications require predictable performance and tasks in these applications have deadlines to be met. In this paper, we propose an efficient algorithm for nonpreemptive scheduling of dynamically arriving real-time tasks (aperiodic tasks) in multiprocessor systems. A real-time task is characterized by its deadline, resource requirements, and worst case computation time on p p...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: International Journal of Intelligent Information Systems
سال: 2015
ISSN: 2328-7675
DOI: 10.11648/j.ijiis.s.2015040201.13